A Study of Scalable Search Algorithm on Unstructured P2P System (Work-in-Progress)
نویسندگان
چکیده
We proposed a search algorithm to unstructured P2P network, which consists of ranked neighbor caching, queryhit caching, and file replication to free riders. And the simulation results show that the algorithm can extend the search region but reduce the search traffic, and also balance the network load, so that acquires the whole network scalable.
منابع مشابه
An Efficient and Scalable Search Mechanism in Unstructured Peer to Peer Network
Peer-to-peer (P2P) network systems gain a huge popularity due to their scalability and reliability in architectures and search facilities. Basically, most of the real world P2P network is unstructured. Due to their unstructured nature it is often impossible to pre-define the searching criteria. As a solution, flooding scheme is used in most cases. But one major limitation of flooding is its que...
متن کاملGGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کاملSemSearch: A Scalable Semantic Searching Algorithm for Unstructured P2P Network
Resource searching in the current peer-to-peer (P2P) applications is mainly based on the keyword match. However, more and more P2P applications require an efficient semantic searching based on the contents. In this paper, we propose a novel scalable semantic searching algorithm named SemSearch for the unstructured P2P networks. For the consistency and flexibility of semantic analysis, we integr...
متن کاملReplication in Unstructured Peer-to-Peer Networks with Availability Constraints
Random walks have been proven a scalable search strategy for unstructured peerto-peer (P2P) networks. In a random walk, a query message is forwarded at each step to a randomly chosen neighbor for a limited number of hops. If random walks are employed as a search strategy, data replication is an important method to increase the probability of successful search. In this context, we investigate th...
متن کاملInterconnecting Unstructured P2P File Sharing Networks
Currently there are a lot of public P2P file sharing networks in existence. Some of them have millions of users. There is a need for a system that can search and download from every P2P network. This article describes a novel structured interconnection system that works over multiple unstructured P2P file sharing networks and provides additional management features. This system works across dif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007